Multiple Boosting in the Ant Colony Decision Forest meta-classifier
نویسندگان
چکیده
The idea of ensemble methodology is to combine multiple predictive models in order to achieve a better prediction performance. In this task we analyze the self-adaptive methods for improving the performance of Ant Colony Decision Tree and Forest algorithms. Our goal is to present and compare new metaensemble approaches based on Ant Colony Optimization. The proposed meta-classifiers (consisting of homogeneous classifiers) can be characterized by the self-adaptability or the good accommodation with the analyzed data sets and offer appropriate classification accuracy. In this article we provide an overview of ensemble methods in classification tasks and concentrate on the different methodologies, such as Bagging, Boosting and Random Forest. We present all important types of ensemble methods including Boosting and Bagging in context of distributed approach, where agent-ants create better solutions employing adaptive mechanisms. Self adaptive, combining methods and modeling appropriate issues, such as ensembles presented here are discussed in context of the quality of the results. Smaller trees in decision forest without loss of accuracy are achieved during the analysis of different data sets. 2014 Elsevier B.V. All rights reserved.
منابع مشابه
Portfolio Optimization by Means of Meta Heuristic Algorithms
Investment decision making is one of the key issues in financial management. Selecting the appropriate tools and techniques that can make optimal portfolio is one of the main objectives of the investment world. This study tries to optimize the decision making in stock selection or the optimization of the portfolio by means of the artificial colony of honey bee algorithm. To determine the effect...
متن کاملLearning Multi-tree Classification Models with Ant Colony Optimization
Ant Colony Optimization (ACO) is a meta-heuristic for solving combinatorial optimization problems, inspired by the behaviour of biological ant colonies. One of the successful applications of ACO is learning classification models (classifiers). A classifier encodes the relationships between the input attribute values and the values of a class attribute in a given set of labelled cases and it can...
متن کاملA Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملOptimal Cluster Selection Based on Ant Colony Optimization for Cluster Oriented Ensemble Classifier in Stream data classification
In this paper we proposed a method of optimal selection of cluster for cluster oriented classifier. The cluster oriented classifier is great advantage over binary and conventional classifier. The cluster oriented classifier work very efficiently on real and sample data. But the cluster oriented ensemble classifier faced a problem of selection of number of cluster for ensemble. In current fashio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Knowl.-Based Syst.
دوره 75 شماره
صفحات -
تاریخ انتشار 2015